منابع مشابه
fault location in power distribution networks using matching algorithm
چکیده رساله/پایان نامه : تاکنون روشهای متعددی در ارتباط با مکان یابی خطا در شبکه انتقال ارائه شده است. استفاده مستقیم از این روشها در شبکه توزیع به دلایلی همچون وجود انشعابهای متعدد، غیر یکنواختی فیدرها (خطوط کابلی، خطوط هوایی، سطح مقطع متفاوت انشعاب ها و تنه اصلی فیدر)، نامتعادلی (عدم جابجا شدگی خطوط، بارهای تکفاز و سه فاز)، ثابت نبودن بار و اندازه گیری مقادیر ولتاژ و جریان فقط در ابتدای...
Disjoint, Partition and Intersection Constraints for Set and Multiset Variables
We have started a systematic study of global constraints on set and multiset variables. We consider here disjoint, partition, and intersection constraints. These global constraints fall into one of three classes. In the first class, we show that we can decompose the constraint without hindering bound consistency. No new algorithms therefore need be developed for such constraints. In the second ...
متن کاملThe Maximum Partition Matching
Let S = fC 1 ; C 2 ; : : :; C k g be a collection of pairwise disjoint subsets of U = f1; 2; : : :; ng such that S k i=1 C i = U. A partition matching of S consists of two subsets fa 1 ; a 2 ; : : :; a m g and fb 1 ; b 2 ; : : :; b m g of U together with a sequence of distinct partitions of) such that a i is contained in a subset in the collection A i and b i is contained in a subset in the col...
متن کاملIntegrating Graph Partition and Matching with Editing
Many computer vision tasks can be posed as either a graph partitioning (segmentation) problem or a graph matching (correspondence) problem. In this paper, we present an integrated solution for simultaneous graph partition and matching with graph editing. Our objective is to find and match an unknown number of common graph structures (objects) in two images – a problem arising in recent object r...
متن کاملPartition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley's Process
We investigate partitioning of integer sequences into heapable subsequences (previously defined and established by Mitzenmacher et al. [BHMZ11]). We show that an extension of patience sorting computes the decomposition into a minimal number of heapable subsequences (MHS). We connect this parameter to an interactive particle system, a multiset extension of Hammersley’s process, and investigate i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2019
ISSN: 0090-6778,1558-0857
DOI: 10.1109/tcomm.2018.2881091